Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications
نویسندگان
چکیده
منابع مشابه
Fuzzy Detour Boundary Vertices in Fuzzy Graphs
A vertex v in a connected fuzzy graph G is a fuzzy detour boundary vertex of a vertex u, if ) , ( ) , ( v u w u Δ ≤ Δ for every fuzzy detour neighbour w of v. This paper is devoted to see how the fuzzy detour boundary vertices are related to fuzzy detour interior vertices. Further, the relation between the fuzzy detour boundary vertices and fuzzy detour eccentric vertices are also studied. Some...
متن کاملON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملThe tree longest detour problem in a biconnected graph
In a biconnected graph, a detour is the best alternative path from a detour-starting vertex to the destination vertex. A detour-starting vertex is the vertex from which the original shortest path is changed. The longest detour (LD) problem is to find a detour-critical edge in a shortest path such that the removal of the edge results in the maximum distance increment. In this paper, we deal with...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملOn edge detour graphs
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hacettepe Journal of Mathematics and Statistics
سال: 2019
ISSN: 1303-5010
DOI: 10.15672/hjms.2019.666